On Generalized Dyck Paths
نویسنده
چکیده
We generalize the elegant bijective proof of the Chung Feller theorem from the paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].
منابع مشابه
ECO method and hill-free generalized Motzkin paths
In this paper we study the class of generalized Motzkin paths with no hills and prove some of their combinatorial properties in a bijective way; as a particular case we have the Fine numbers, enumerating Dyck paths with no hills. Using the ECO method, we define a recursive construction for Dyck paths such that the number of local expansions performed on each path depends on the number of its hi...
متن کاملCounting Generalized Dyck Paths
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from (0, 0) to (n, n) which is below the diagonal line y = x. One way to generalize the definition of Dyck path is to change the end point of Dyck path, i.e. we define (generalized) Dyck path to be a lattice path from (0, 0) to (m, n) ∈ N2 which is below the diagonal line y...
متن کاملar X iv : 0 80 5 . 12 73 v 1 [ m at h . C O ] 9 M ay 2 00 8 BELL POLYNOMIALS AND k - GENERALIZED DYCK PATHS
Abstract. A k-generalized Dyck path of length n is a lattice path from (0, 0) to (n, 0) in the plane integer lattice Z × Z consisting of horizontal-steps (k, 0) for a given integer k ≥ 0, up-steps (1, 1), and down-steps (1,−1), which never passes below the x-axis. The present paper studies three kinds of statistics on k-generalized Dyck paths: ”number of u-segments”, ”number of internal u-segme...
متن کاملGeneralized Small Schröder Numbers
We study generalized small Schröder paths in the sense of arbitrary sizes of steps. A generalized small Schröder path is a generalized lattice path from (0, 0) to (2n, 0) with the step set of {(k, k), (l,−l), (2r, 0) | k, l, r ∈ P}, where P is the set of positive integers, which never goes below the x-axis, and with no horizontal steps at level 0. We find a bijection between 5-colored Dyck path...
متن کاملAn exhaustive generation algorithm for Catalan objects and others
The paper presents a CAT generation algorithm for Dyck paths with fixed length n. It is the formalization of a method for the exhaustive generation of these paths which can be described by two equivalent strategies. The former uses a rooted tree, the latter lists the paths and provides a visit of the nodes of the tree, basing on three simple operations. These constructions are strictly connecte...
متن کاملReturns and Hills on Generalized Dyck Paths
In 2009, Shapiro posed the following question: “What is the asymptotic proportion of Dyck paths having an even number of hills?” In this paper, we answer Shapiro’s question, as well as a generalization of the question to ternary paths. We find that the probability that a randomly chosen ternary path has an even number of hills approaches 125/169 as the length of the path approaches infinity. Ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011